Heuristics for the inversion median problem
نویسندگان
چکیده
منابع مشابه
Heuristics for the generalized median graph problem
Structural approaches for pattern recognition frequently make use of graphs to represent objects. The concept of object similarity is of great importance in pattern recognition. The graph edit distance is often used to measure the similarity between two graphs. It basically consists in the amount of distortion needed to transform one graph into the other. The median graph of a set S of graphs i...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملLocal Search Heuristics for k - median
In the k-median and facility location problems, we are given two sets: F , the set of facilities and C, the set of clients. There is a specified distance cij ≥ 0 (forming a metric) between every pair i, j ∈ F ∪C. The goal is to identify a subset of facilities S ⊆ F and to serve the clients in C by the facilities in S, such that the cost function is minimized. Formally, the k-median problem is d...
متن کاملEfficient heuristics for Median Cycle Problems
This article proposes a number of efficient heuristics for two versions of the Median Cycle Problem (MCP). In both versions the aim is to construct a simple cycle containing a subset of the vertices of a mixed graph. In the first version the objective is to minimize the cost of cycle and the cost of assigning vertices not on the cycle to the nearest vertex on the cycle. In the second version th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2010
ISSN: 1471-2105
DOI: 10.1186/1471-2105-11-s1-s30